Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation
نویسندگان
چکیده
منابع مشابه
network optimization with piecewise linear convex costs
the problem of finding the minimum cost multi-commodity flow in an undirected and completenetwork is studied when the link costs are piecewise linear and convex. the arc-path model and overflowmodel are presented to formulate the problem. the results suggest that the new overflow model outperformsthe classical arc-path model for this problem. the classical revised simplex, frank and wolf and a ...
متن کاملANOVA decomposition of convex piecewise linear functions
Piecewise linear convex functions arise as integrands in stochastic programs. They are Lipschitz continuous on their domain, but do not belong to tensor product Sobolev spaces. Motivated by applying Quasi-Monte Carlo methods we show that all terms of their ANOVA decomposition, except the one of highest order, are smooth if the underlying densities are smooth and a certain geometric condition is...
متن کاملExplicit Univariate Global Optimization with Piecewise Linear Support Functions
Piecewise linear convex and concave support functions combined with Pijavskii’s method are proposed to be used for solving global optimization problems. Rules for constructing support functions are introduced.
متن کاملSeparable Concave Optimization Approximately Equals Piecewise Linear Optimization
We study the problem of minimizing a nonnegative separable concave function over a compact feasible set. We approximate this problem to within a factor of 1 + 2 by a piecewise-linear minimization problem over the same feasible set. Our main result is that when the feasible set is a polyhedron, the number of resulting pieces is polynomial in the input size of the polyhedron and linear in 1/2. Fo...
متن کاملSpace Efficient Approximation of Piecewise Linear Functions
In this work, we compute upper bounds of piecewise linear functions which is a special case of piecewise linear approximation. There are several application areas like pattern recognition or cartography. The goal is to reduce the number of sampling points while still preserving the characteristics of given data. The problem of approximating a given piecewise linear function with n sampling poin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2006
ISSN: 0377-0427
DOI: 10.1016/j.cam.2005.10.034